Rank and Distance in Organizations.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Total Rank Distance And Scaled Total Rank Distance: Two Alternative Metrics In Computational Linguistics

In this paper we propose two metrics to be used in various fields of computational linguistics area. Our construction is based on the supposition that in most of the natural languages the most important information is carried by the first part of the unit. We introduce total rank distance and scaled total rank distance, we prove that they are metrics and investigate their max and expected value...

متن کامل

Fuzzy Authentication using Rank Distance

Fuzzy authentication allows authentication based on the fuzzy matching of two objects, for example based on the similarity of two strings in the Hamming metric, or on the similiarity of two sets in the set difference metric. Aim of this paper is to show other models and algorithms of secure fuzzy authentication, which can be performed using the rank metric. A few schemes are presented which can...

متن کامل

Rank Distance as a Stylistic Similarity

In this paper we propose a new distance function (rank distance) designed to reflect stylistic similarity between texts. To assess the ability of this distance measure to capture stylistic similarity between texts, we tested it in two different machine learning settings: clustering and binary classification.

متن کامل

Skew codes of prescribed distance or rank

In this paper we propose two methods to produce block codes of prescribed rank or distance. Following [4, 5] we work with skew polynomial rings of automorphism type and the codes we investigate are ideals in quotients of this ring. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section. 1 Galois theory of di...

متن کامل

Linear Rank-Width of Distance-Hereditary Graphs

We present a characterization of the linear rank-width of distancehereditary graphs. Using the characterization, we show that the linear rankwidth of every n-vertex distance-hereditary graph can be computed in time O(n · log(n)), and a linear layout witnessing the linear rank-width can be computed with the same time complexity. For our characterization, we combine modifications of canonical spl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Studies in Regional Science

سال: 1991

ISSN: 0287-6256,1880-6465

DOI: 10.2457/srs.21.2_1